Clausal Logic and Logic Programming in Algebraic Domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Clausal Logic and Logic Programming in Algebraic Domains

We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and pro...

متن کامل

Clausal Logic and Logic Programming in Coherent Domains

Synopsis. We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of a coherent algebraic dcpo. The robustness of this approach comes from the agreement bewteen the declarative semantics and the xed-point semantics, as well as the agreement between the xed-point semantics and the semantics...

متن کامل

Learning in Clausal Logic: A Perspective on Inductive Logic Programming

Inductive logic programming is a form of machine learning from examples which employs the representation formalism of clausal logic. One of the earliest inductive logic programming systems was Ehud Shapiro’s Model Inference System [90], which could synthesise simple recursive programs like append/3. Many of the techniques devised by Shapiro, such as top-down search of program clauses by refinem...

متن کامل

Resolution and Logic Programming in Algebraic Domains: Negation and Defaults

W.C. Rounds and G.-Q. Zhang have recently proposed to study a form of disjunctive logic programming generalized to algebraic domains [RZ01]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with negative information, i.e. the implicit or explicit absence of bits of information. These inv...

متن کامل

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

In this paper we extend the notion of  degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and  introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 2001

ISSN: 0890-5401

DOI: 10.1006/inco.2001.3073